Relational labels can improve relational retrieval

نویسندگان

  • Anja Jamrozik
  • Dedre Gentner
چکیده

Retrieval that is based on common relational structure, such as an underlying principle or pattern, is useful but typically rare. Based on evidence that comparison-derived schema abstraction can improve relational retrieval, we asked whether the use of relational labels can also promote abstraction and improve relational retrieval. Using a cued-recall paradigm, we varied the presence of relational labels at encoding and test. As compared to a no-label baseline condition, relational retrieval improved when relational labels were given at encoding and at test and also when relational labels were given only at encoding. The findings demonstrate that one way to improve relational retrieval is through the use of labels that name relational structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational labels: A simple way to improve the likelihood of relational retrieval

The first step of successful analogical transfer is relational retrieval—retrieval that is based on common relational structure, such as an underlying principle or pattern. Unfortunately, purely relational retrieval often fails. Previous work has shown that schema abstraction via comparing two examples can improve relational retrieval. We asked whether labels that name relational structure migh...

متن کامل

The specificity of the labeling effect on memory: what kinds of labels improve retrieval?

Relational retrieval—retrieval that is based on common relational structure, such as an underlying principle or pattern, is typically rare. Previously, we found that providing relational labels at encoding and/or test can improve relational retrieval (Jamrozik & Gentner, 2013). In the current work, we tested the specificity of the labeling effect by comparing the effects of relational labels (e...

متن کامل

Active Learning of Strict Partial Orders: A Case Study on Concept Prerequisite Relations

Strict partial order is a mathematical structure commonly seen in relational data. One obstacle to extracting such type of relations at scale is the lack of large scale labels for building effective data-driven solutions. We develop an active learning framework for mining such relations subject to a strict order. Our approach incorporates relational reasoning not only in finding new unlabeled p...

متن کامل

Learning via Equivalence Constraints, with applications to the Enhancement of Image and Video Retrieval

Making sense of large amounts of unlabeled data is hard, but this is what we are up against in many real life situations. Our key observation is that in many real life applications additional partial information about the data can be obtained with very little cost. For example, in video indexing we may want to use the fact that a sequence of faces obtained from successive frames in roughly the ...

متن کامل

An Approach to Image Retrieval on Fuzzy Object-Relational Databases using Dominant Color Descriptors

In this paper we introduce a fuzzy approach for image retrieval based on color features. Our method deals with two problems related to imprecision: the vagueness in the color description and the representation of fuzzy data in database models. To face the first problem, the concept of dominant fuzzy color is introduced to describe the image, using linguistic labels for representing the color in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013